An Efficient Squaring Architecture for GF ( 2 m ) and its Applications in Cryptographic Systems ∗
نویسندگان
چکیده
This contribution describes a squarer architecture for standard basis field representation. This architecture is based on the observation that one can transform a squaring operation in GF (2 m) into an addition and a multiplication of two elements of special form, which computational time depends on the form of the field polynomial.
منابع مشابه
An Efficient Squaring Architecture for GF (2) and its Applications in Cryptographic Systems
This contribution describes a squarer architecture for standard basis field representation. This architecture is based on the observation that one can transform a squaring operation in GF (2m) into an addition and a multiplication of two elements of special form, which computational time depends on the form of the field polynomial.
متن کاملA Novel and Efficient Hardware Implementation of Scalar Point Multiplier
A new and highly efficient architecture for elliptic curve scalar point multiplication is presented. To achieve the maximum architectural and timing improvements we have reorganized and reordered the critical path of the Lopez-Dahab scalar point multiplication architecture such that logic structures are implemented in parallel and operations in the critical path are diverted to noncritical path...
متن کاملDual-Field Multiplier Architecture for Cryptographic Applications
The multiplication operation in finite fields GF (p) and GF (2) is the most often used and timeconsuming operation in the harware and software realizations of public-key cryptographic systems, particularly elliptic curve cryptography. We propose a new hardware architecture for fast and efficient execution of the multiplication operation in this paper. The proposed architecture is scalable, i.e....
متن کاملDiscrete Logarithms in Finite Fields and Their Cryptographic Significance
Given a primitive element g of a finite field GF(q), the discrete logarithm of a nonzero element u ∈ GF(q) is that integer k, 1 ≤ k ≤ q − 1, for which u = g k . The well-known problem of computing discrete logarithms in finite fields has acquired additional importance in recent years due to its applicability in cryptography. Several cryptographic systems would become insecure if an efficient di...
متن کاملFast Arithmetic Architectures for Public - KeyAlgorithms over
This contribution describes a new class of arithmetic architectures for Galois elds GF(2 k). The main applications of the architecture are public-key systems which are based on the discrete logarithm problem for elliptic curves. The architectures use a representation of the eld GF(2 k) as GF((2 n) m), where k = n m. The approach explores bit parallel arithmetic in the subbeld GF(2 n), and seria...
متن کامل